Iterative Viterbi decoding について

Words near each other

・ Iterative and incremental development
・ Iterative aspect
・ Iterative closest point
・ Iterative compression
・ Iterative deepening A*
・ Iterative deepening depth-first search
・ Iterative design
・ Iterative impedance
・ Iterative learning control
・ Iterative method
・ Iterative proportional fitting
・ Iterative Receiver Design
・ Iterative reconstruction
・ Iterative refinement
・ Iterative Template Library
・ Iterative Viterbi decoding
・ Iteratively reweighted least squares
・ Iterator
・ Iterator pattern
・ Iteri language
・ Iteris
・ ITerm2
・ Itero de la Vega
・ Itero del Castillo
・ Iteron
・ Ites
・ Itesalat
・ Itesham Uddin
・ Itesiwaju
・ ITest

Dictionary Lists

mini英和辞書

翻訳と辞書　辞書検索 [ 開発暫定版 ]

スポンサードリンク

Iterative Viterbi decoding ：ウィキペディア英語版

Iterative Viterbi decoding
Iterative Viterbi decoding is an algorithm that spots the subsequence ''S'' of an observation ''O'' = having the highest average probability (i.e., probability scaled by the length of ''S'') of being generated by a given hidden Markov model ''M'' with ''m'' states. The algorithm uses a modified Viterbi algorithm as an internal step.
The scaled probability measure was first proposed by John S. Bridle. An early algorithm to solve this problem, sliding window, was proposed by Jay G. Wilpon et al., 1989, with constant cost ''T'' = ''mn''²/2.
A faster algorithm consists of an iteration of calls to the Viterbi algorithm, reestimating a filler score until convergence.
== The algorithm ==

A basic (non-optimized) version, finding the sequence ''s'' with the smallest normalized distance from some subsequence of ''t'' is:


// input is placed in observation s(), template t(),
// and distance matrix d()
// remaining elements in matrices are solely for internal computations
(int, int, int) AverageSubmatchDistance(char s(), char t(), int d())

The ViterbiDistance() procedure returns the tuple (''e'', ''B'', ''E''), i.e., the Viterbi score "''e''" for the match of ''t'' and the selected entry (''B'') and exit (''E'') points from it. "''B''" and "''E''" have to be recorded using a simple modification to Viterbi.
A modification that can be applied to CYK tables, proposed by Antoine Rozenknop, consists in subtracting ''e'' from all elements of the initial matrix ''d''.

抄文引用元・出典: フリー百科事典『ウィキペディア（Wikipedia）』
■ウィキペディアで「Iterative Viterbi decoding」の詳細全文を読む

スポンサードリンク

翻訳と辞書 : 翻訳のためのインターネットリソース